Step of Proof: mul_preserves_lt
12,41
postcript
pdf
Inference at
*
1
2
1
I
of proof for Lemma
mul
preserves
lt
:
1.
a
:
2.
b
:
3. (
a
+1)
b
4.
n
:
5. 1 <
n
6. (((
n
- 1) *
a
)+1)
((
n
- 1) *
b
)
(
n
*
a
) < (
n
*
b
)
latex
by ((FwdThruLemma `add_functionality_wrt_le` [3;6])
CollapseTHENA ((Auto_aux (first_nat 1:n
C
) ((first_nat 1:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
1
:
C1:
7. (
a
+1+((
n
- 1) *
a
)+1)
(
b
+((
n
- 1) *
b
))
C1:
(
n
*
a
) < (
n
*
b
)
C
.
Definitions
t
T
,
P
Q
,
x
:
A
.
B
(
x
)
Lemmas
add
functionality
wrt
le
origin